Ten Weeks with Chinese Bandits.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ten Weeks with Chinese Bandits

We, wondered when we opened this book why it should be sent to a medical journal for review. Then we found ourselves looking at its beautiful photographs, then the story seized our attention, and we did not lay the book down until it was finished. And as we closed it, we realised that it is eminently a book for review by a medical journal, for the medical problems of China with which it so larg...

متن کامل

Bandits with an Edge

We consider a bandit problem over a graph where the rewards are not directly observed. Instead, the decision maker can compare two nodes and receive (stochastic) information pertaining to the difference in their value. The graph structure describes the set of possible comparisons. Consequently, comparing between two nodes that are relatively far requires estimating the difference between every ...

متن کامل

Nonparametric Bandits with Covariates

We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random covariate. The goal is to maximize cumulative expected reward. We derive general lower bounds on the performance of any admissible policy, and develop an algorithm whose performance achieves the order of said lower bound ...

متن کامل

Influence Maximization with Bandits

We consider the problem of influence maximization in networks, maximizing the number of people that become aware of a product by finding the ‘best’ set of ‘seed’ users to expose the product to. Most prior work on this topic assumes that we know the probability of each user influencing each other user, or we have data that lets us estimate these influences. However, this information is typically...

متن کامل

Semi-Bandits with Knapsacks

We unify two prominent lines of work on multi-armed bandits: bandits with knapsacks and combinatorial semi-bandits. The former concerns limited “resources” consumed by the algorithm, e.g., limited supply in dynamic pricing. The latter allows a huge number of actions but assumes combinatorial structure and additional feedback to make the problem tractable. We define a common generalization, supp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Royal Institute of International Affairs

سال: 1927

ISSN: 1473-799X

DOI: 10.2307/3014848